Approximating Market Equilibria

نویسندگان

  • Kamal Jain
  • Mohammad Mahdian
  • Amin Saberi
چکیده

In this paper we consider the classic problem of finding the market equilibrium prices under linear utility functions. A notion of approximate market equilibrium was proposed by Deng, Papadimitriou and Safra [5]. Using this notion, we present the first fully polynomial-time approximation scheme for finding a market equilibrium price vector. The main tool in our algorithm is the polynomial-time algorithm of Devanur et al. [6] for a variant of the problem in which there is a clear demarcation between buyers and sellers. Their algorithm is used as a subroutine in our algorithm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Complexity View of Markets with Social Influence

In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, in which each trader’s utility may be influenced by the bundles of goods obtained by her social neighbors. The goal of this paper is to understand and characterize the impact of social influence on the complexity of com...

متن کامل

Market Equilibria with Hybrid Linear-Leontief Utilities

We introduce a new family of utility functions for exchange markets. This family provides a natural and ”continuous” hybridization of the traditional linear and Leontief utilities and might be useful in understanding the complexity of computing and approximating of market equilibria. We show that a Fisher equilibrium of an exchange market with m commodities and n traders and hybrid linear-Leont...

متن کامل

Approximating Nash Equilibria in Tree Polymatrix Games

We develop a quasi-polynomial time Las Vegas algorithm for approximating Nash equilibria in polymatrix games over trees, under a mild renormalizing assumption. Our result, in particular, leads to an expected polynomial-time algorithm for computing approximate Nash equilibria of tree polymatrix games in which the number of actions per player is a fixed constant. Further, for trees with constant ...

متن کامل

Administrative rationing and multiple equilibria

In this paper, we introduce non-interest profit/loss sharing (PLS) banks into a three-period overlapping generations model. Two types, (low- and high quality) investments are assumed and capital accumulation and level of output in the steady state is considered. Then, administrative rationing is introduced to the model. It is shown that the level of capital accumulation and output in equilibriu...

متن کامل

Nash Equilibria via Polynomial Equations

We consider the problem of computing a Nash equilibrium in multiple-player games. It is known that there exist games, in which all the equilibria have irrational entries in their probability distributions [19]. This suggests that either we should look for symbolic representations of equilibria or we should focus on computing approximate equilibria. We show that every finite game has an equilibr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003